Generalized Golub--Kahan Bidiagonalization and Stopping Criteria

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Golub-Kahan Bidiagonalization and Stopping Criteria

The Golub–Kahan bidiagonalization algorithm has been widely used in solving leastsquares problems and in the computation of the SVD of rectangular matrices. Here we propose an algorithm based on the Golub–Kahan process for the solution of augmented systems that minimizes the norm of the error and, in particular, we propose a novel estimator of the error similar to the one proposed by Hestenes a...

متن کامل

Band Generalization of the Golub-Kahan Bidiagonalization, Generalized Jacobi Matrices, and the Core Problem

The concept of the core problem in total least squares (TLS) problems was introduced in [C. C. Paige and Z. Strakoš, SIAM J. Matrix Anal. Appl., 27, 2006, pp. 861–875]. It is based on orthogonal transformations such that the resulting problem decomposes into two independent parts, with one of the parts having trivial (zero) right-hand side and maximal dimensions, and the other part with nonzero...

متن کامل

Global Golub-Kahan bidiagonalization applied to large discrete ill-posed problems

We consider the solution of large linear systems of equations that arise from the discretization of ill-posed problems. The matrix has a Kronecker product structure and the right-hand side is contaminated by measurement error. Problems of this kind arise, for instance, from the discretization of Fredholm integral equations of the first kind in two space-dimensions with a separable kernel and in...

متن کامل

Large-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation

In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...

متن کامل

GCV for Tikhonov regularization via global Golub-Kahan decomposition

Generalized Cross Validation (GCV) is a popular approach to determining the regularization parameter in Tikhonov regularization. The regularization parameter is chosen by minimizing an expression, which is easy to evaluate for small-scale problems, but prohibitively expensive to compute for large-scale ones. This paper describes a novel method, based on Gauss-type quadrature, for determining up...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2013

ISSN: 0895-4798,1095-7162

DOI: 10.1137/120866543